The Maximum-Weight Stable Matching Problem: Duality and Efficiency
نویسندگان
چکیده
منابع مشابه
The Maximum-Weight Stable Matching Problem: Duality and Efficiency
Given a preference system (G, ≺) and an integral weight function defined on the edge set of G (not necessarily bipartite), the maximum-weight stable matching problem is to find a stable matching of (G, ≺) with maximum total weight. We study this N P-hard problem using linear programming and polyhedral approaches, and show that the Rothblum system for defining the fractional stable matching poly...
متن کاملThe maximum weight hierarchy matching problem
We study the problem of fusing several reports about a group of objects into a single summary report, which best represents the received reports. A report is a list of labels associated with a group of objects, as reported by some identification device. Reports do not associate which object in the group has been given a specific label, the labels used in each report may be given in various leve...
متن کاملThe labeled maximum matching problem
Given a graph G where a label is associated with each edge, we address the problem of looking for a maximum matching of G using the minimum number of different labels, namely the Labeled Maximum Matching Problem. It is a relatively new problem whose application is related to the timetabling problem [15]. We prove it is NP-complete and present four different mathematical formulations. Moreover, ...
متن کاملThe weighted stable matching problem
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching of minimum or maximum weight. This problem is known to be NP-hard in general. Our contribution is two fold: a polyhedral characterization and an approximation algorithm. Previously Chen et al. have shown that the stab...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2012
ISSN: 0895-4801,1095-7146
DOI: 10.1137/120864866